منابع مشابه
Distributed Memory Allocation Problem
This work attempts to study and offer a solution to an important resource allocation problem for explicitly parallel computing architectures. The problem of buffer space allocation in distributed on-chip memories is the key to lowering configuration (re-programming) overhead for systems such as SCORE [2] and enabling efficient virtualization of hardware resources essential for exploitation of s...
متن کاملBlock-Based Allocation Algorithms for FLASH Memory in Embedded Systems
A flash memory has write-once and bulk-erase properties so that an intelligent allocation algorithm is essential to providing applications efficient storage service. This paper first demonstrates that the online version of FLASH allocation problem is difficult, since we can find an adversary that makes every online algorithm to use as many number of blocks as a naive and inefficient algorithm. ...
متن کاملConnict Graph Based Allocation of Static Objects to Memory Banks
Several architectures, in particular those speciically designed for digital signal processing, have a memory structure that consists of a number of banks with diierent characteristics (waitstate, size, ...). There may also exist constraints on the accessibility of these banks, as some bank combinations can be accessed in parallel, while others can not. As memory access connicts lead to pipeline...
متن کاملA Novel Lattice Associative Memory Based on Dendritic Computing
We present a novel hetero-associative memory based on dendritic neural computation. The computations in this model are based on lattice group operations. The proposed model does not suffer from the usual storage capacity problem and is extremely robust in the presence of various types of noise and data corruption.
متن کاملBalanced Allocation: Memory Performance Tradeoffs
Suppose we sequentially put n balls into n bins. If we put each ball into a random bin then the heaviest bin will contain ∼ logn/ log logn balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180–200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ∼ l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2005
ISSN: 0018-9340
DOI: 10.1109/tc.2005.167